On Solution Sets of Nonconvex Darboux Problems and Applications to Optimal Control with Endpoint Constraints
نویسنده
چکیده
We prove a continuous version of a relaxation theorem for the nonconvex Darboux problem x,T e F(t, z, x, x,,xz). This result allows us to use Warga's open mapping theorem for deriving necessary conditions in the form of a maximum principle for optimization problems with endpoint constraints. Neither constraint qualification nor regularity assumption is supposed.
منابع مشابه
Optimal Control of Nonconvex Discrete and Differential Inclusions
Optimization problems for discrete and diierential inclusions have many important applications and generalize both standard and nonstandard models in optimal control for open-loop and closed-loop control systems. In this paper we consider optimal control problems for dynamic systems governed by such inclusions with general endpoint constraints. We provide a variational analysis of diierential i...
متن کاملA Neural Network Method Based on Mittag-Leffler Function for Solving a Class of Fractional Optimal Control Problems
In this paper, a computational intelligence method is used for the solution of fractional optimal control problems (FOCP)'s with equality and inequality constraints. According to the Ponteryagin minimum principle (PMP) for FOCP with fractional derivative in the Riemann- Liouville sense and by constructing a suitable error function, we define an unconstrained minimization problem. In the optimiz...
متن کاملApproximate Maximum Principle for Discrete Approximations of Optimal Control Systems with Nonsmooth Objectives and Endpoint Constraints
The paper studies discrete/finite-difference approximations of optimal control problems governed by continuous-time dynamical systems with endpoint constraints. Finitedifference systems, considered as parametric control problems with the decreasing step of discretization, occupy an intermediate position between continuous-time and discrete-time (with fixed steps) control processes and play a si...
متن کاملAn Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems
By p-power (or partial p-power) transformation, the Lagrangian function in nonconvex optimization problem becomes locally convex. In this paper, we present a neural network based on an NCP function for solving the nonconvex optimization problem. An important feature of this neural network is the one-to-one correspondence between its equilibria and KKT points of the nonconvex optimizatio...
متن کاملVariational Analysis of Evolution Inclusions
The paper is devoted to optimization problems of the Bolza and Mayer types for evolution systems governed by nonconvex Lipschitzian differential inclusions in Banach spaces under endpoint constraints described by finitely many equalities and inequalities. with generally nonsmooth functions. We develop a variational analysis of such problems mainly based on their discrete approximations and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004